Algorithmic Verification of Constraint Satisfaction Method on Timetable Problem
نویسندگان
چکیده
منابع مشابه
Algorithmic Composition as a Constraint Satisfaction Problem
Throughout the history, musicians have always used music composition rules, which actually are in most cases prohibitions or constraints. The elements of music with which composers work, as well as the possible combinations of those elements, make up a huge finite set of values. The composer’s function is to select, from this big set, a subset of values, which will be arranged into a certain te...
متن کاملApplying Constraint Satisfaction Technique in University Timetable Scheduling
Planning and scheduling are often NP-complete problems. There have been different approaches to tackle these problems. With the emergence of constraint logic programming, the constraint satisfaction approach has started to attract attention due to its effectness in solving these real-life problems. In this paper, we report our experience of applying constraint logic programming to fully automat...
متن کاملDistributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. This pap...
متن کاملThe Distributed Constraint Satisfaction Problem :
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Arti cial Intelligence can be formalized as distributed CSPs. We prese...
متن کاملInfinite Domain Constraint Satisfaction Problem
The computational and descriptive complexity of finite domain fixed template constraint satisfaction problem (CSP) is a well developed topic that combines several areas in mathematics and computer science. Allowing the domain to be infinite provides a way larger playground which covers many more computational problems and requires further mathematical tools. I will talk about some of the resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Statistics
سال: 2020
ISSN: 2332-2071,2332-2144
DOI: 10.13189/ms.2020.080614